Connections between Wiener index and matchings

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Connections between Wiener index and matchings

Let T be an acyclic molecule with n vertices, and let S(T ) be the acyclic molecule obtained from T by replacing each edge of T by a path of length two. In this work, we show that the Wiener index of T can be explained as the number of matchings with n− 2 edges in S(T ). Furthermore, some related results are also obtained.

متن کامل

An inequality between the edge-Wiener index and the Wiener index of a graph

The Wiener index W (G) of a connected graph G is defined to be the sum

متن کامل

Generalizations of Wiener Polarity Index and Terminal Wiener Index

In theoretical chemistry, distance-based molecular structure descriptors are used for modeling physical, pharmacologic, biological and other properties of chemical compounds. We introduce a generalizedWiener polarity indexWk(G) as the number of unordered pairs of vertices {u, v} of G such that the shortest distance d(u, v) between u and v is k. For k = 3, we get standard Wiener polarity index. ...

متن کامل

Relationship between the Hosoya polynomial and the hyper-Wiener index

The Hosoya polynomial of a graph, H(G, z), has the property that its first derivative, evaluated at z = 1, equals the Wiener index, i.e., W(G) = H’(G, 1). In this paper, an equation is presented that gives the hyper-Wiener index, WW(G), in terms of the first and second derivatives of H(G,z). Also defined here is a hyper-Hosoya polynomial, HH(G,r), which has the property WW(G) = HH’(G, l), analo...

متن کامل

On the difference between the Szeged and the Wiener index

We prove a conjecture of Nadjafi-Arani et al. on the difference between the Szeged and the Wiener index of a graph (M. J. Nadjafi-Arani, H. Khodashenas, A. R. Ashrafi: Graphs whose Szeged and Wiener numbers differ by 4 and 5, Math. Comput. Modelling 55 (2012), 1644–1648). Namely, if G is a 2-connected non-complete graph on n vertices, then Sz (G) −W (G) ≥ 2n − 6. Furthermore, the equality is ob...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Mathematical Chemistry

سال: 2005

ISSN: 0259-9791,1572-8897

DOI: 10.1007/s10910-005-9026-0